Memorialization of Maironis with Respect to Literary Canonization (1932–1940)
نویسندگان
چکیده
منابع مشابه
a comparison of teachers and supervisors, with respect to teacher efficacy and reflection
supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...
15 صفحه اولLIFTING MODULES WITH RESPECT TO A PRERADICAL
Let $M$ be a right module over a ring $R$, $tau_M$ a preradical on $sigma[M]$, and$Ninsigma[M]$. In this note we show that if $N_1, N_2in sigma[M]$ are two$tau_M$-lifting modules such that $N_i$ is $N_j$-projective ($i,j=1,2$), then $N=N_1oplusN_2$ is $tau_M$-lifting. We investigate when homomorphic image of a $tau_M$-lifting moduleis $tau_M$-lifting.
متن کاملFinite canonization
The canonization theorem says that for given m, n for some m (the first one is called ER(n;m)) we have for every function f with domain [1, . . . , m], for some A ∈ [1, . . . , m], the question of when the equality f(i1, . . . , in) = f(j1, . . . , jn) (where i1 < · · · < in and j1 < · · · jn are from A) holds has the simplest answer: for some v ⊆ {1, . . . , n} the equality holds iff ∧
متن کاملFrom Invariants to Canonization in Parallel
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, then f is called a canonical form for graphs. Gurevich [Gur97] proves that any polynomial-time computable complete invariant can be transformed into a polynomial-time computable canonical form. We extend this equivale...
متن کاملPtime Canonization for Two Variables with Counting
We consider innnitary logic with two variable symbols and counting quantiiers, C 2 , and its intersection with Ptime on nite relational structures. In particular we exhibit a Ptime canonization procedure for nite relational structures which provides unique representatives up to equivalence in C 2. As a consequence we obtain a recursive presentation for the class of all those queries on arbitrar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lituanistica
سال: 2017
ISSN: 2424-4716,0235-716X
DOI: 10.6001/lituanistica.v63i2.3535